Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("irregular programs")

Results 1 to 7 of 7

  • Page / 1
Export

Selection :

  • and

Runtime and language support for compiling adaptive irregular programs on distributed-memory machinesYUAN-SHIN HWANG; BONGKI MOON; SHARMA, S. D et al.Software, practice & experience. 1995, Vol 25, Num 6, pp 597-621, issn 0038-0644Article

The Tao of Parallelism in AlgorithmsPINGALI, Keshav; NGUYEN, Donald; PROUNTZOS, Dimitrios et al.ACM SIGPLAN notices. 2011, Vol 46, Num 6, pp 12-25, issn 1523-2867, 14 p.Conference Paper

Parallel Inclusion-based Points-to AnalysisMENDEZ-LOJO, Mario; MATHEW, Augustine; PINGALI, Keshav et al.ACM SIGPLAN notices. 2010, Vol 45, Num 10, pp 428-443, issn 1523-2867, 16 p.Conference Paper

Optimistic Parallelism Benefits from Data PartitioningKULKARNI, Milind; PINGALI, Keshav; RAMANARAYANAN, Ganesh et al.ACM SIGPLAN notices. 2008, Vol 43, Num 3, pp 233-243, issn 1523-2867, 11 p.Conference Paper

Synthesizing Concurrent Schedulers for Irregular AlgorithmsNGUYEN, Donald; PINGALI, Keshav.ACM SIGPLAN notices. 2011, Vol 46, Num 3, pp 333-344, issn 1523-2867, 12 p.Conference Paper

Structure-driven Optimizations for Amorphous Data-parallel ProgramsMENDEZ-LOJO, Mario; NGUYEN, Donald; PROUNTZOS, Dimitrios et al.ACM SIGPLAN notices. 2010, Vol 45, Num 5, pp 3-14, issn 1523-2867, 12 p.Conference Paper

Optimistic parallelism requires abstractionsKULKARNI, Milind; PINGALI, Keshav; WALTER, Bruce et al.ACM SIGPLAN notices. 2007, Vol 42, Num 6, pp 211-222, issn 1523-2867, 12 p.Conference Paper

  • Page / 1